On a question of Babadi and Tarokh II
نویسندگان
چکیده
In this paper we continue to study a question proposed by Babadi and Tarokh [4] on the mysterious randomness of Gold sequences. Upon improving their result, we establish the randomness of product of pseudorandom matrices formed from two linear block codes with respect to the empirical spectral distribution, if the dual distance of both codes is at least 5, hence providing an affirmative answer to the question. Index Terms Asymptotic spectral distribution, coding theory, Gold sequences, Marchenko-Pastur law, random matrix theory.
منابع مشابه
Comment on "Asymptotic Achievability of the Cramér-Rao Bound for Noisy Compressive Sampling"
In [1], we proved the asymptotic achievability of the Cramér-Rao bound in the compressive sensing setting in the linear sparsity regime. In the proof, we used an erroneous closed-form expression of ασ for the genie-aided Cramér-Rao bound σTr(AIAI) −1 from Lemma 3.5, which appears in Eqs. (20) and (29). The proof, however, holds if one avoids replacing σTr(AIAI) −1 by the expression of Lemma 3.5...
متن کاملA Distributed Dynamic Frequency Allocation Algorithm For Ad Hoc Networks
We propose a distributed dynamic frequency allocation algorithm that achieves performance close to that of a centralized optimal algorithm. In our network model, nodes are grouped into a number of clusters. Each cluster chooses its transmission frequency band based on its knowledge of the interference that it experiences. The convergence of the proposed distributed algorithm to a sub-optimal fr...
متن کاملAn Adaptive Greedy Algorithm with Application to Sparse Narma Identification
Greedy algorithms form an essential tool for compressed sensing. However, their inherent batch mode discourages their use in time-varying environments due to significant complexity and storage requirements. In this paper a powerful greedy scheme developed in [1, 2] is converted into an adaptive algorithm which is applied to estimation of nonlinear channels. Performance is assessed via computer ...
متن کاملSPARLS: A Low Complexity Recursive $\mathcal{L}_1$-Regularized Least Squares Algorithm
We develop a Recursive L1-Regularized Least Squares (SPARLS) algorithm for the estimation of a sparse tap-weight vector in the adaptive filtering setting. The SPARLS algorithm exploits noisy observations of the tap-weight vector output stream and produces its estimate using an ExpectationMaximization type algorithm. Simulation studies in the context of channel estimation, employing multipath wi...
متن کاملMulti-objective design of fuzzy logic controller in supply chain
Unlike commonly used methods, in this paper, we have introduced a new approach for designing fuzzy controllers. In this approach, we have simultaneously optimized both objective functions of a supply chain over a two-dimensional space. Then, we have obtained a spectrum of optimized points, each of which represents a set of optimal parameters which can be chosen by the manager ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1308.4499 شماره
صفحات -
تاریخ انتشار 2013